Barriers to cervical screening participation in high-risk women

Aim Women aged 25–35 years, for whom cervical cancer is most problematic, are least likely to participate in the cervical screening programme. Therefore, identifying barriers to screening participation in this high-risk group is essential. Subject and methods A sample of 430 women completed an electronic survey of their cervical screening history and answered questions on sociodemographic, behavioural, attitudinal and informational barriers to cervical screening uptake. Logistic regression was used to predict cervical screening non attendance. Results Women with more than 10 sexual partners in their lifetime were more likely, but women from ethnic minorities, less likely to participate in the cervical screening programme. Women unaware of the recommended screening interval were also less likely to be screened, as were women who believed that screening is a test for cancer. Screening was also less likely among women who endorsed the belief that screening in the absence of symptoms is unnecessary. Conclusion These data highlight poor knowledge of the recommended screening interval and purpose of cervical cancer screening in this high-risk group. As such, interventions that target these informational barriers might be most effective for increasing cervical screening uptake in this high-risk group

Sparse Coding on Symmetric Positive Definite Manifolds using Bregman Divergences

This paper introduces sparse coding and dictionary learning for Symmetric Positive Definite (SPD) matrices, which are often used in machine learning, computer vision and related areas. Unlike traditional sparse coding schemes that work in vector spaces, in this paper we discuss how SPD matrices can be described by sparse combination of dictionary atoms, where the atoms are also SPD matrices. We propose to seek sparse coding by embedding the space of SPD matrices into Hilbert spaces through two types of Bregman matrix divergences. This not only leads to an efficient way of performing sparse coding, but also an online and iterative scheme for dictionary learning. We apply the proposed methods to several computer vision tasks where images are represented by region covariance matrices. Our proposed algorithms outperform state-of-the-art methods on a wide range of classification tasks, including face recognition, action recognition, material classification and texture categorization

Hidden Markov Models for Spatio-Temporal Pattern Recognition and Image Segmentation

Time and again hidden Markov models have been demonstrated to be highly effective in one-dimensional pattern recognition and classification problems such as speech recognition. A great deal of attention is now focussed on 2-D and possibly 3-D applications arising from problems encountered in computer vision in domains such as gesture, face, and handwriting recognition. Despite their widespread usage and numerous successful applications, there are few analytical results which can explain their remarkably good performance and guide researchers in selecting topologies and parameters to improve classification performance

Matching Image Sets via Adaptive Multi Convex Hull

Traditional nearest points methods use all the samples in an image set to construct a single convex or affine hull model for classification. However, strong artificial features and noisy data may be generated from combinations of training samples when significant intra-class variations and/or noise occur in the image set. Existing multi-model approaches extract local models by clustering each image set individually only once, with fixed clusters used for matching with various image sets. This may not be optimal for discrimination, as undesirable environmental conditions (eg. illumination and pose variations) may result in the two closest clusters representing different characteristics of an object (eg. frontal face being compared to non-frontal face). To address the above problem, we propose a novel approach to enhance nearest points based methods by integrating affine/convex hull classification with an adapted multi-model approach. We first extract multiple local convex hulls from a query image set via maximum margin clustering to diminish the artificial variations and constrain the noise in local convex hulls. We then propose adaptive reference clustering (ARC) to constrain the clustering of each gallery image set by forcing the clusters to have resemblance to the clusters in the query image set. By applying ARC, noisy clusters in the query set can be discarded. Experiments on Honda, MoBo and ETH-80 datasets show that the proposed method outperforms single model approaches and other recent techniques, such as Sparse Approximated Nearest Points, Mutual Subspace Method and Manifold Discriminant Analysis.Comment: IEEE Winter Conference on Applications of Computer Vision (WACV), 201

Multi-Action Recognition via Stochastic Modelling of Optical Flow and Gradients

In this paper we propose a novel approach to multi-action recognition that performs joint segmentation and classification. This approach models each action using a Gaussian mixture using robust low-dimensional action features. Segmentation is achieved by performing classification on overlapping temporal windows, which are then merged to produce the final result. This approach is considerably less complicated than previous methods which use dynamic programming or computationally expensive hidden Markov models (HMMs). Initial experiments on a stitched version of the KTH dataset show that the proposed approach achieves an accuracy of 78.3%, outperforming a recent HMM-based approach which obtained 71.2%

Efficient Clustering on Riemannian Manifolds: A Kernelised Random Projection Approach

Reformulating computer vision problems over Riemannian manifolds has demonstrated superior performance in various computer vision applications. This is because visual data often forms a special structure lying on a lower dimensional space embedded in a higher dimensional space. However, since these manifolds belong to non-Euclidean topological spaces, exploiting their structures is computationally expensive, especially when one considers the clustering analysis of massive amounts of data. To this end, we propose an efficient framework to address the clustering problem on Riemannian manifolds. This framework implements random projections for manifold points via kernel space, which can preserve the geometric structure of the original space, but is computationally efficient. Here, we introduce three methods that follow our framework. We then validate our framework on several computer vision applications by comparing against popular clustering methods on Riemannian manifolds. Experimental results demonstrate that our framework maintains the performance of the clustering whilst massively reducing computational complexity by over two orders of magnitude in some cases

Assessing the psychophysiological pathways that link chronic stress with increased vulnerability for ill health

This programme of work investigated the psychophysiological pathways that link chronic stress with increased vulnerability for ill health. Data from study one indicated that atypical patterns of cortisol secretion, widely implicated in the aetiologies of severe pathologic conditions, partially mediated the effect of higher perceived levels of stress on greater incidences of the kinds of common health problems that typically affect young otherwise healthy individuals. As a logical next step in the programme, studies two and three looked more closely at the psychophysiological consequences of informal caregiving, one prototypical model for chronic stress. Data indicated that caring for child with autism/ADHD exacts a considerable psychophysiological toll on the carer. Indeed, relative to controls, caregivers reported increased psychological morbidity, greater incidences of ill health and reduced social support. Dysregulated immunity, manifested by higher concentrations of the inflammatory marker, C-reactive protein (CRP) was also apparent in the caregivers. In fact, caregivers’ mean concentrations of CRP satisfied clinical criterion for moderate risk of cardiovascular pathologies, compared with low risk in the controls. However, psychological morbidity and incidences of ill health were reduced in caregivers who reported greater social support. Socially supported caregivers also displayed a steeper cortisol awakening response (CAR), which is indicative of more adaptive endocrine functioning. Therefore, interventions that enhance social connectivity might be effective for alleviating caregiver related stress. However, logistical challenges such as a lack of alternate and reliable supervision make it difficult for caregivers to access support related interventions, most of which are time consuming and based outside the home. Expressive writing on the other hand is a simple and time effective intervention that can run in participants’ homes, and as such, might be especially well suited for informal caregivers. Data from study four indicated that writing about the benefits of caring for a child with autism/ADHD can be applied as a home based intervention, and is associated with clinically meaningful improvements in caregivers’ psychological well being

TV-GAN: Generative Adversarial Network Based Thermal to Visible Face Recognition

This work tackles the face recognition task on images captured using thermal camera sensors which can operate in the non-light environment. While it can greatly increase the scope and benefits of the current security surveillance systems, performing such a task using thermal images is a challenging problem compared to face recognition task in the Visible Light Domain (VLD). This is partly due to the much smaller amount number of thermal imagery data collected compared to the VLD data. Unfortunately, direct application of the existing very strong face recognition models trained using VLD data into the thermal imagery data will not produce a satisfactory performance. This is due to the existence of the domain gap between the thermal and VLD images. To this end, we propose a Thermal-to-Visible Generative Adversarial Network (TV-GAN) that is able to transform thermal face images into their corresponding VLD images whilst maintaining identity information which is sufficient enough for the existing VLD face recognition models to perform recognition. Some examples are presented in Figure 1. Unlike the previous methods, our proposed TV-GAN uses an explicit closed-set face recognition loss to regularize the discriminator network training. This information will then be conveyed into the generator network in the forms of gradient loss. In the experiment, we show that by using this additional explicit regularization for the discriminator network, the TV-GAN is able to preserve more identity information when translating a thermal image of a person which is not seen before by the TV-GAN

Extrinsic Methods for Coding and Dictionary Learning on Grassmann Manifolds

Sparsity-based representations have recently led to notable results in various visual recognition tasks. In a separate line of research, Riemannian manifolds have been shown useful for dealing with features and models that do not lie in Euclidean spaces. With the aim of building a bridge between the two realms, we address the problem of sparse coding and dictionary learning over the space of linear subspaces, which form Riemannian structures known as Grassmann manifolds. To this end, we propose to embed Grassmann manifolds into the space of symmetric matrices by an isometric mapping. This in turn enables us to extend two sparse coding schemes to Grassmann manifolds. Furthermore, we propose closed-form solutions for learning a Grassmann dictionary, atom by atom. Lastly, to handle non-linearity in data, we extend the proposed Grassmann sparse coding and dictionary learning algorithms through embedding into Hilbert spaces. Experiments on several classification tasks (gender recognition, gesture classification, scene analysis, face recognition, action recognition and dynamic texture classification) show that the proposed approaches achieve considerable improvements in discrimination accuracy, in comparison to state-of-the-art methods such as kernelized Affine Hull Method and graph-embedding Grassmann discriminant analysis.Comment: Appearing in International Journal of Computer Visio

3D Reconstruction through Segmentation of Multi-View Image Sequences

We propose what we believe is a new approach to 3D reconstruction through the design of a 3D voxel volume, such that all the image information and camera geometry are embedded into one feature space. By customising the volume to be suitable for segmentation, the key idea that we propose is the recovery of a 3D scene through the use of globally optimal geodesic active contours. We also present an extension to this idea by proposing the novel design of a 4D voxel volume to analyse the stereo motion problem in multi-view image sequences